Proxying slice access requests during a data evacuation

ABSTRACT

A method begins by a processing module receiving a checked write slice request from a requesting entity. The method continues by determining that locally stored encoded data slices do not include the requested encoded data slice. The method continues by identifying an alternate location for the requested encoded data slice. The method continues by determining whether the alternate location is associated with storage of the encoded data slice. The method continues when the alternate location is associated with the storage of the encoded data slice, by issuing a favorable checked write slice response to a requesting entity. The method can include facilitating transfer of the requested encoded data slice from the alternate location to the storage unit for storage.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present U.S. Utility patent application claims priority pursuant toU.S.C. § 120 as a continuation of U.S. Utility application Ser. No.16/001,686, entitled “PROXYING SLICE ACCESS REQUESTS DURING A DATAEVACUATION”, filed Jun. 6, 2018, which is a continuation of U.S. Utilityapplication Ser. No. 15/220,983, entitled “PROXYING SLICE ACCESSREQUESTS DURING A DATA EVACUATION”, filed Jul. 27, 2016, issued as U.S.Pat. No. 10,073,736 on Sep. 11, 2018, which claims priority pursuant to35 U.S.C. § 119(e) to U.S. Provisional Application No. 62/199,816,entitled “STORING DATA AND ASSOCIATED METADATA IN A DISPERSED STORAGENETWORK,” filed Jul. 31, 2015, all of which are hereby incorporatedherein by reference in their entirety and made part of the present U.S.Utility patent application for all purposes.

STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT

Not applicable.

INCORPORATION-BY-REFERENCE OF MATERIAL SUBMITTED ON A COMPACT DISC

Not applicable.

BACKGROUND OF THE INVENTION Technical Field of the Invention

This invention relates generally to computer networks and moreparticularly to dispersing error encoded data.

Description of Related Art

Computing devices are known to communicate data, process data, and/orstore data. Such computing devices range from wireless smart phones,laptops, tablets, personal computers (PC), work stations, and video gamedevices, to data centers that support millions of web searches, stocktrades, or on-line purchases every day. In general, a computing deviceincludes a central processing unit (CPU), a memory system, userinput/output interfaces, peripheral device interfaces, and aninterconnecting bus structure.

As is further known, a computer may effectively extend its CPU by using“cloud computing” to perform one or more computing functions (e.g., aservice, an application, an algorithm, an arithmetic logic function,etc.) on behalf of the computer. Further, for large services,applications, and/or functions, cloud computing may be performed bymultiple cloud computing resources in a distributed manner to improvethe response time for completion of the service, application, and/orfunction. For example, Hadoop is an open source software framework thatsupports distributed applications enabling application execution bythousands of computers.

In addition to cloud computing, a computer may use “cloud storage” aspart of its memory system. As is known, cloud storage enables a user,via its computer, to store files, applications, etc. on an Internetstorage system. The Internet storage system may include a RAID(redundant array of independent disks) system and/or a dispersed storagesystem that uses an error correction scheme to encode data for storage.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWING(S)

FIG. 1 is a schematic block diagram of an embodiment of a dispersed ordistributed storage network (DSN) in accordance with the presentinvention;

FIG. 2 is a schematic block diagram of an embodiment of a computing corein accordance with the present invention;

FIG. 3 is a schematic block diagram of an example of dispersed storageerror encoding of data in accordance with the present invention;

FIG. 4 is a schematic block diagram of a generic example of an errorencoding function in accordance with the present invention;

FIG. 5 is a schematic block diagram of a specific example of an errorencoding function in accordance with the present invention;

FIG. 6 is a schematic block diagram of an example of a slice name of anencoded data slice (EDS) in accordance with the present invention;

FIG. 7 is a schematic block diagram of an example of dispersed storageerror decoding of data in accordance with the present invention;

FIG. 8 is a schematic block diagram of a generic example of an errordecoding function in accordance with the present invention;

FIG. 9 is a schematic block diagram of an embodiment proxying sliceaccess requests during a data evacuation in accordance with the presentinvention;

FIG. 9A is a schematic block diagram of another embodiment proxyingslice access requests during a data evacuation in accordance with thepresent invention;

FIG. 9B is a schematic block diagram of another embodiment proxyingslice access requests during a data evacuation in accordance with thepresent invention; and

FIG. 9C is a logic diagram of an example method proxying slice accessrequests during a data evacuation in accordance with the presentinvention.

DETAILED DESCRIPTION OF THE INVENTION

FIG. 1 is a schematic block diagram of an embodiment of a dispersed, ordistributed, storage network (DSN) 10 that includes a plurality ofcomputing devices 12-16, a managing unit 18, an integrity processingunit 20, and a DSN memory 22. The components of the DSN 10 are coupledto a network 24, which may include one or more wireless and/or wirelined communication systems; one or more non-public intranet systemsand/or public internet systems; and/or one or more local area networks(LAN) and/or wide area networks (WAN).

The DSN memory 22 includes a plurality of storage units 36 that may belocated at geographically different sites (e.g., one in Chicago, one inMilwaukee, etc.), at a common site, or a combination thereof. Forexample, if the DSN memory 22 includes eight storage units 36, eachstorage unit is located at a different site. As another example, if theDSN memory 22 includes eight storage units 36, all eight storage unitsare located at the same site. As yet another example, if the DSN memory22 includes eight storage units 36, a first pair of storage units are ata first common site, a second pair of storage units are at a secondcommon site, a third pair of storage units are at a third common site,and a fourth pair of storage units are at a fourth common site. Notethat a DSN memory 22 may include more or less than eight storage units36. Further note that each storage unit 36 includes a computing core (asshown in FIG. 2, or components thereof) and a plurality of memorydevices for storing dispersed error encoded data.

Each of the computing devices 12-16, the managing unit 18, and theintegrity processing unit 20 include a computing core 26, which includesnetwork interfaces 30-33. Computing devices 12-16 may each be a portablecomputing device and/or a fixed computing device. A portable computingdevice may be a social networking device, a gaming device, a cell phone,a smart phone, a digital assistant, a digital music player, a digitalvideo player, a laptop computer, a handheld computer, a tablet, a videogame controller, and/or any other portable device that includes acomputing core. A fixed computing device may be a computer (PC), acomputer server, a cable set-top box, a satellite receiver, a televisionset, a printer, a fax machine, home entertainment equipment, a videogame console, and/or any type of home or office computing equipment.Note that each of the managing unit 18 and the integrity processing unit20 may be separate computing devices, may be a common computing device,and/or may be integrated into one or more of the computing devices 12-16and/or into one or more of the storage units 36.

Each interface 30, 32, and 33 includes software and hardware to supportone or more communication links via the network 24 indirectly and/ordirectly. For example, interface 30 supports a communication link (e.g.,wired, wireless, direct, via a LAN, via the network 24, etc.) betweencomputing devices 14 and 16. As another example, interface 32 supportscommunication links (e.g., a wired connection, a wireless connection, aLAN connection, and/or any other type of connection to/from the network24) between computing devices 12 & 16 and the DSN memory 22. As yetanother example, interface 33 supports a communication link for each ofthe managing unit 18 and the integrity processing unit 20 to the network24.

Computing devices 12 and 16 include a dispersed storage (DS) clientmodule 34, which enables the computing device to dispersed storage errorencode and decode data as subsequently described with reference to oneor more of FIGS. 3-8. In this example embodiment, computing device 16functions as a dispersed storage processing agent for computing device14. In this role, computing device 16 dispersed storage error encodesand decodes data on behalf of computing device 14. With the use ofdispersed storage error encoding and decoding, the DSN 10 is tolerant ofa significant number of storage unit failures (the number of failures isbased on parameters of the dispersed storage error encoding function)without loss of data and without the need for a redundant or backupcopies of the data. Further, the DSN 10 stores data for an indefiniteperiod of time without data loss and in a secure manner (e.g., thesystem is very resistant to unauthorized attempts at accessing thedata).

In operation, the managing unit 18 performs DS management services. Forexample, the managing unit 18 establishes distributed data storageparameters (e.g., vault creation, distributed storage parameters,security parameters, billing information, user profile information,etc.) for computing devices 12-14 individually or as part of a group ofuser devices. As a specific example, the managing unit 18 coordinatescreation of a vault (e.g., a virtual memory block associated with aportion of an overall namespace of the DSN) within the DSTN memory 22for a user device, a group of devices, or for public access andestablishes per vault dispersed storage (DS) error encoding parametersfor a vault. The managing unit 18 facilitates storage of DS errorencoding parameters for each vault by updating registry information ofthe DSN 10, where the registry information may be stored in the DSNmemory 22, a computing device 12-16, the managing unit 18, and/or theintegrity processing unit 20.

The DSN managing unit 18 creates and stores user profile information(e.g., an access control list (ACL)) in local memory and/or withinmemory of the DSN memory 22. The user profile information includesauthentication information, permissions, and/or the security parameters.The security parameters may include encryption/decryption scheme, one ormore encryption keys, key generation scheme, and/or dataencoding/decoding scheme.

The DSN managing unit 18 creates billing information for a particularuser, a user group, a vault access, public vault access, etc. Forinstance, the DSTN managing unit 18 tracks the number of times a useraccesses a non-public vault and/or public vaults, which can be used togenerate per-access billing information. In another instance, the DSTNmanaging unit 18 tracks the amount of data stored and/or retrieved by auser device and/or a user group, which can be used to generateper-data-amount billing information.

As another example, the managing unit 18 performs network operations,network administration, and/or network maintenance. Network operationsincludes authenticating user data allocation requests (e.g., read and/orwrite requests), managing creation of vaults, establishingauthentication credentials for user devices, adding/deleting components(e.g., user devices, storage units, and/or computing devices with a DSclient module 34) to/from the DSN 10, and/or establishing authenticationcredentials for the storage units 36. Network administration includesmonitoring devices and/or units for failures, maintaining vaultinformation, determining device and/or unit activation status,determining device and/or unit loading, and/or determining any othersystem level operation that affects the performance level of the DSN 10.Network maintenance includes facilitating replacing, upgrading,repairing, and/or expanding a device and/or unit of the DSN 10.

The integrity processing unit 20 performs rebuilding of ‘bad’ or missingencoded data slices. At a high level, the integrity processing unit 20performs rebuilding by periodically attempting to retrieve/list encodeddata slices, and/or slice names of the encoded data slices, from the DSNmemory 22. For retrieved encoded slices, they are checked for errors dueto data corruption, outdated version, etc. If a slice includes an error,it is flagged as a ‘bad’ slice. For encoded data slices that were notreceived and/or not listed, they are flagged as missing slices. Badand/or missing slices are subsequently rebuilt using other retrievedencoded data slices that are deemed to be good slices to produce rebuiltslices. The rebuilt slices are stored in the DSTN memory 22.

FIG. 2 is a schematic block diagram of an embodiment of a computing core26 that includes a processing module 50, a memory controller 52, mainmemory 54, a video graphics processing unit 55, an input/output (IO)controller 56, a peripheral component interconnect (PCI) interface 58,an IO interface module 60, at least one IO device interface module 62, aread only memory (ROM) basic input output system (BIOS) 64, and one ormore memory interface modules. The one or more memory interfacemodule(s) includes one or more of a universal serial bus (USB) interfacemodule 66, a host bus adapter (HBA) interface module 68, a networkinterface module 70, a flash interface module 72, a hard drive interfacemodule 74, and a DSN interface module 76.

The DSN interface module 76 functions to mimic a conventional operatingsystem (OS) file system interface (e.g., network file system (NFS),flash file system (FFS), disk file system (DFS), file transfer protocol(FTP), web-based distributed authoring and versioning (WebDAV), etc.)and/or a block memory interface (e.g., small computer system interface(SCSI), internet small computer system interface (iSCSI), etc.). The DSNinterface module 76 and/or the network interface module 70 may functionas one or more of the interface 30-33 of FIG. 1. Note that the IO deviceinterface module 62 and/or the memory interface modules 66-76 may becollectively or individually referred to as IO ports.

FIG. 3 is a schematic block diagram of an example of dispersed storageerror encoding of data. When a computing device 12 or 16 has data tostore it disperse storage error encodes the data in accordance with adispersed storage error encoding process based on dispersed storageerror encoding parameters. The dispersed storage error encodingparameters include an encoding function (e.g., information dispersalalgorithm, Reed-Solomon, Cauchy Reed-Solomon, systematic encoding,non-systematic encoding, on-line codes, etc.), a data segmentingprotocol (e.g., data segment size, fixed, variable, etc.), and per datasegment encoding values. The per data segment encoding values include atotal, or pillar width, number (T) of encoded data slices per encodingof a data segment i.e., in a set of encoded data slices); a decodethreshold number (D) of encoded data slices of a set of encoded dataslices that are needed to recover the data segment; a read thresholdnumber (R) of encoded data slices to indicate a number of encoded dataslices per set to be read from storage for decoding of the data segment;and/or a write threshold number (W) to indicate a number of encoded dataslices per set that must be accurately stored before the encoded datasegment is deemed to have been properly stored. The dispersed storageerror encoding parameters may further include slicing information (e.g.,the number of encoded data slices that will be created for each datasegment) and/or slice security information (e.g., per encoded data sliceencryption, compression, integrity checksum, etc.).

In the present example, Cauchy Reed-Solomon has been selected as theencoding function (a generic example is shown in FIG. 4 and a specificexample is shown in FIG. 5); the data segmenting protocol is to dividethe data object into fixed sized data segments; and the per data segmentencoding values include: a pillar width of 5, a decode threshold of 3, aread threshold of 4, and a write threshold of 4. In accordance with thedata segmenting protocol, the computing device 12 or 16 divides the data(e.g., a file (e.g., text, video, audio, etc.), a data object, or otherdata arrangement) into a plurality of fixed sized data segments (e.g., 1through Y of a fixed size in range of Kilo-bytes to Tera-bytes or more).The number of data segments created is dependent of the size of the dataand the data segmenting protocol.

The computing device 12 or 16 then disperse storage error encodes a datasegment using the selected encoding function (e.g., Cauchy Reed-Solomon)to produce a set of encoded data slices. FIG. 4 illustrates a genericCauchy Reed-Solomon encoding function, which includes an encoding matrix(EM), a data matrix (DM), and a coded matrix (CM). The size of theencoding matrix (EM) is dependent on the pillar width number (T) and thedecode threshold number (D) of selected per data segment encodingvalues. To produce the data matrix (DM), the data segment is dividedinto a plurality of data blocks and the data blocks are arranged into Dnumber of rows with Z data blocks per row. Note that Z is a function ofthe number of data blocks created from the data segment and the decodethreshold number (D). The coded matrix is produced by matrix multiplyingthe data matrix by the encoding matrix.

FIG. 5 illustrates a specific example of Cauchy Reed-Solomon encodingwith a pillar number (T) of five and decode threshold number of three.In this example, a first data segment is divided into twelve data blocks(D1-D12). The coded matrix includes five rows of coded data blocks,where the first row of X11-X14 corresponds to a first encoded data slice(EDS 1_1), the second row of X21-X24 corresponds to a second encodeddata slice (EDS 2_1), the third row of X31-X34 corresponds to a thirdencoded data slice (EDS 3_1), the fourth row of X41-X44 corresponds to afourth encoded data slice (EDS 4_1), and the fifth row of X51-X54corresponds to a fifth encoded data slice (EDS 5_1). Note that thesecond number of the EDS designation corresponds to the data segmentnumber.

Returning to the discussion of FIG. 3, the computing device also createsa slice name (SN) for each encoded data slice (EDS) in the set ofencoded data slices. A typical format for a slice name 60 is shown inFIG. 6. As shown, the slice name (SN) 60 includes a pillar number of theencoded data slice (e.g., one of 1-T), a data segment number (e.g., oneof 1-Y), a vault identifier (ID), a data object identifier (ID), and mayfurther include revision level information of the encoded data slices.The slice name functions as, at least part of, a DSN address for theencoded data slice for storage and retrieval from the DSN memory 22.

As a result of encoding, the computing device 12 or 16 produces aplurality of sets of encoded data slices, which are provided with theirrespective slice names to the storage units for storage. As shown, thefirst set of encoded data slices includes EDS 1_1 through EDS 5_1 andthe first set of slice names includes SN 1_1 through SN 5_1 and the lastset of encoded data slices includes EDS 1_Y through EDS 5_Y and the lastset of slice names includes SN 1_Y through SN 5_Y.

FIG. 7 is a schematic block diagram of an example of dispersed storageerror decoding of a data object that was dispersed storage error encodedand stored in the example of FIG. 4. In this example, the computingdevice 12 or 16 retrieves from the storage units at least the decodethreshold number of encoded data slices per data segment. As a specificexample, the computing device retrieves a read threshold number ofencoded data slices.

To recover a data segment from a decode threshold number of encoded dataslices, the computing device uses a decoding function as shown in FIG.8. As shown, the decoding function is essentially an inverse of theencoding function of FIG. 4. The coded matrix includes a decodethreshold number of rows (e.g., three in this example) and the decodingmatrix in an inversion of the encoding matrix that includes thecorresponding rows of the coded matrix. For example, if the coded matrixincludes rows 1, 2, and 4, the encoding matrix is reduced to rows 1, 2,and 4, and then inverted to produce the decoding matrix.

FIG. 9 is a schematic block diagram of proxying slice access requestsduring a data evacuation. Data evacuation is a process by which a firstds unit is removed from the system, a second ds unit is added to thesystem to replace the first ds unit, and the first ds unit proceeds towrite all of its slices as quickly as possible to the second ds unit.This enables replacement of a faulty or otherwise inadequate ds unitwith a new one while minimizing rebuilding, which is considerably moreexpensive in terms of network and processing resources. However, itsuffers from several issues: slices that are deleted are stilltransferred over the network wasting time and resources, slices that arenot yet transferred over cannot be read, reducing availability andreliability, checked write operations will not check against the correctversion if it has not yet been transferred and listing requests returnempty results, causing unnecessary rebuilding to occur. These issues maybe prevented or eliminated by introducing proxying of requests from thesecond ds unit to the first ds unit, during the period the evacuationtakes place.

When the second ds unit receives a read request for a slice it does nothave, and if the evacuation is ongoing, it may transmit an identicalread request to the first ds unit, and use the returned result toformulate a read response to return to the original requester. If thesecond ds unit receives a write request for a slice it does not have,and the request is a checked write the second ds unit may send aCheckRequest to the first ds unit, and use the response to apply thecheck condition for the slice it received. If the check succeeds, thenit processes the write successfully, otherwise the second ds unit failsthe write request with a check condition error. If the second ds unitreceives a finalize/undo request for a slice it has, it may proxy thesefor the first ds unit which will delete the slice, and prevent it fromhaving to be transferred over the network. If the second ds unitreceives a list request, it may proxy the list request to the first dsunit and combines its listing results with the results obtained fromrunning that same list locally.

By proxying the above requests in the following ways, evacuation is spedup, unnecessary rebuilding is prevented, and read and checked writerequests will operate as expected. Once the evacuation is completed,normal behavior resumes and the second ds unit stops proxying requests.

FIG. 9 shows a dispersed storage network (DSN) 10 that includes thedistributed storage and task (DST) processing unit 16 of FIG. 1, thenetwork 24 of FIG. 1, and at least two storage units (DS unit 1 and DSunit 2). The DST processing unit 16 includes the DST client module 34 ofFIG. 1. As shown, slices are to be transferred between DS unit 1(evacuation storage unit) to DS unit 2 (replacement/target storageunit). Each storage unit includes at least DS client module 34 of FIG.1, and a memory 88. The memory 88 may be implemented utilizing one ormore of solid-state memory, magnetic disk drive memory, optical diskdrive memory, etc. Each DS unit may be implemented utilizing the DSTexecution unit 36 of FIG. 1. Hereafter, each DST execution unit may beinterchangeably referred to as a storage unit or DS unit and a storageset may be interchangeably referred to as a set of storage units or as aset of DS units. The DSN functions to store data.

In an example of operation of evacuation and replacement, a storageunit, for example, DS unit 2 receives a checked write request from theDST processing unit 16. For example, the DST client module 34 of DSTprocessing unit 16 selects DS unit 2 to access to an encoded data slice(during evacuation of DS unit 1), generates a checked write slicerequest 1 that includes one or more of the encoded data slice and aslice name associated with the encoded data slice, and sends, via thenetwork 24, the checked write slice request 1 to the DS unit 2.

FIG. 9A is a schematic block diagram of another embodiment proxyingslice access requests during a data evacuation in accordance with thepresent invention. As shown, having received the checked write request1, DS unit 2 determines that locally stored encoded data slices 422 donot include the requested encoded data slice. For instance, the DSTclient module 34 of the DS unit 2 determines that the encoded dataslices stored in the memory 88 of the DS unit 2 do not include therequested encoded data slices as DS unit 1 has not completed movingslices from the memory 88 of the DS unit 1 to the memory 88 of DS unit2, in accordance with an initiated evacuation.

Having determined that the locally stored encoded data slices to notinclude the requested encoded data slice, DS unit 2 determines at leastone alternate location for the requested encoded data slice (i.e., DSunit 1). For example, the DST client module 34 of DS unit 2 sends, viathe network 24, a checked request 1 to DS unit 1 and receives, via thenetwork 24, a checked response 1 from the DS unit 1, and interprets thechecked response 1 to indicate whether the at least one alternatelocation is associated with the requested encoded data slice.

When the at least one alternate location is associated with the storageof the encoded data slice, DS unit 2 issues a checked response 1 to DSprocessing unit 16, where the checked response 1 indicates successfulaccess to the requested encoded data slice. For example, the DST clientmodule 34 generates the checked response 1 to include one or more of acode associated with the checked write slice request (e.g., a uniqueserial identifier) the slice name, and revision level, and sends, viathe network 24, the checked response 1 to the DST processing unit 16.

FIG. 9B is a schematic block diagram of another embodiment proxyingslice access requests during a data evacuation in accordance with thepresent invention. As shown, alternatively, or in addition to, DSTprocessing unit 16 facilitates transfer of requested encoded data slicesfrom the alternate location (DS unit 1) to DS unit 2 for storage. Forthe example, the DST client module 34 of DS unit 2 sends a read slicerequest to the DST client module 34 of DS unit 1 for the encoded dataslice, receives a transfer slice 1 as the encoded data slice, and storesthe encoded data slice in the memory 88 of the DS unit 2.

FIG. 9C is a flowchart illustrating an example of proxying slice accessrequests during a data evacuation. In particular, a method is presentedfor use in conjunction with one or more functions and features describedin conjunction with FIGS. 1-9B, and also FIG. 9C. The method begins atstep 900 where a processing module (DST processing unit 16) of acomputing device of one or more computing devices of a dispersed storagenetwork initiates an evacuation of encoded storage slices from a firststorage unit to a second storage unit.

Selecting a replacement storage unit candidate to receive evacuatedencoded data slices from a first storage unit can be based on any of:newly commissioned storage units, specific hardware requirements, IOrequirements, speed requirements, storage capacity, historicalreliability, traffic levels, geographic location, or decided by adecentralized agreement module.

A decentralized agreement module receives a ranked scoring informationrequest from a requesting entity with regards to a set of candidateresources. For each candidate resource, the decentralized agreementmodule performs a deterministic function on a location identifier (ID)of the candidate resource and an asset ID of a ranked scoringinformation request to produce an interim result. As a specific example,the decentralized agreement module combines the asset ID and thelocation ID of the candidate resource to produce a combined value andperforms a hashing function on the combined value to produce the interimresult.

For each interim result, the decentralized agreement module performs anormalizing function on the interim result to produce a normalizedinterim result. As a specific example, the decentralized agreementmodule obtains a permutation value associated with the deterministicfunction (e.g., maximum number of permutations of output of thedeterministic function) and divides the interim result by thepermutation value to produce the normalized interim result (e.g., with avalue between 0 and 1).

For each normalized interim result, the decentralized agreement moduleperforms a scoring function on the normalized interim result utilizing alocation weight associated with the candidate resource associated withthe interim result to produce a score of a set of scores. As a specificexample, the decentralized agreement module divides the location weightby a negative log of the normalized interim result to produce the score.

The decentralized agreement module rank orders the set of scores toproduce ranked scoring information (e.g., ranking a highest valuefirst). The decentralized agreement module outputs the ranked scoringinformation to the requesting entity. The requesting entity may utilizethe ranked scoring information to select one storage unit from aplurality of storage units.

The method continues at step 902 where a processing module (DST clientmodule 34) of a computing device of one or more computing devices of adispersed storage network receives a checked write slice request from arequesting entity (e.g., DS unit 2). The method continues at step 904where the processing module determines that locally stored encoded dataslices do not include the requested encoded data slice. For example, theprocessing module performs a lookup or interprets a query response.

The method continues at step 906 where the processing module identifiesan alternate location for the requested encoded data slice (e.g., DSunit 1).

The method continues at step 908 where the processing module determineswhether the alternate location is associated with storage of the encodeddata slice. For example, the processing module issues a checked requestto the alternate location, interprets a checked response, and indicatesthat the requested encoded data slice is located at the alternatestorage location when the checked response indicates storage of theencoded data slice.

When the alternate location is associated with the storage of therequested encoded data slice, the method continues at step 910 where theprocessing module issues a favorable checked write slice response to arequesting entity. For example, the processing module generates theresponse to include one or more of a code associated with the checkedwrite slice request, a slice name and revision level.

Alternatively, or in addition to, the processing module facilitates, instep 912, transfer of the requested encoded data slice from thealternate location for local storage.

The method described above in conjunction with the computing device andthe storage units can alternatively be performed by other modules of thedispersed storage network or by other devices. For example, anycombination of a first module, a second module, a third module, a fourthmodule, etc. of the computing device and the storage units may performthe method described above. In addition, at least one memory section(e.g., a first memory section, a second memory section, a third memorysection, a fourth memory section, a fifth memory section, a sixth memorysection, etc. of a non-transitory computer readable storage medium) thatstores operational instructions can, when executed by one or moreprocessing modules of one or more computing devices and/or by thestorage units of the dispersed storage network (DSN), cause the one ormore computing devices and/or the storage units to perform any or all ofthe method steps described above.

It is noted that terminologies as may be used herein such as bit stream,stream, signal sequence, etc. (or their equivalents) have been usedinterchangeably to describe digital information whose contentcorresponds to any of a number of desired types (e.g., data, video,speech, audio, etc. any of which may generally be referred to as‘data’).

As may be used herein, the terms “substantially” and “approximately”provides an industry-accepted tolerance for its corresponding termand/or relativity between items. Such an industry-accepted toleranceranges from less than one percent to fifty percent and corresponds to,but is not limited to, component values, integrated circuit processvariations, temperature variations, rise and fall times, and/or thermalnoise. Such relativity between items ranges from a difference of a fewpercent to magnitude differences. As may also be used herein, theterm(s) “configured to”, “operably coupled to”, “coupled to”, and/or“coupling” includes direct coupling between items and/or indirectcoupling between items via an intervening item (e.g., an item includes,but is not limited to, a component, an element, a circuit, and/or amodule) where, for an example of indirect coupling, the intervening itemdoes not modify the information of a signal but may adjust its currentlevel, voltage level, and/or power level. As may further be used herein,inferred coupling (i.e., where one element is coupled to another elementby inference) includes direct and indirect coupling between two items inthe same manner as “coupled to”. As may even further be used herein, theterm “configured to”, “operable to”, “coupled to”, or “operably coupledto” indicates that an item includes one or more of power connections,input(s), output(s), etc., to perform, when activated, one or more itscorresponding functions and may further include inferred coupling to oneor more other items. As may still further be used herein, the term“associated with”, includes direct and/or indirect coupling of separateitems and/or one item being embedded within another item.

As may be used herein, the term “compares favorably”, indicates that acomparison between two or more items, signals, etc., provides a desiredrelationship. For example, when the desired relationship is that signal1 has a greater magnitude than signal 2, a favorable comparison may beachieved when the magnitude of signal 1 is greater than that of signal 2or when the magnitude of signal 2 is less than that of signal 1. As maybe used herein, the term “compares unfavorably”, indicates that acomparison between two or more items, signals, etc., fails to providethe desired relationship.

As may also be used herein, the terms “processing module”, “processingcircuit”, “processor”, and/or “processing unit” may be a singleprocessing device or a plurality of processing devices. Such aprocessing device may be a microprocessor, micro-controller, digitalsignal processor, microcomputer, central processing unit, fieldprogrammable gate array, programmable logic device, state machine, logiccircuitry, analog circuitry, digital circuitry, and/or any device thatmanipulates signals (analog and/or digital) based on hard coding of thecircuitry and/or operational instructions. The processing module,module, processing circuit, and/or processing unit may be, or furtherinclude, memory and/or an integrated memory element, which may be asingle memory device, a plurality of memory devices, and/or embeddedcircuitry of another processing module, module, processing circuit,and/or processing unit. Such a memory device may be a read-only memory,random access memory, volatile memory, non-volatile memory, staticmemory, dynamic memory, flash memory, cache memory, and/or any devicethat stores digital information. Note that if the processing module,module, processing circuit, and/or processing unit includes more thanone processing device, the processing devices may be centrally located(e.g., directly coupled together via a wired and/or wireless busstructure) or may be distributedly located (e.g., cloud computing viaindirect coupling via a local area network and/or a wide area network).Further note that if the processing module, module, processing circuit,and/or processing unit implements one or more of its functions via astate machine, analog circuitry, digital circuitry, and/or logiccircuitry, the memory and/or memory element storing the correspondingoperational instructions may be embedded within, or external to, thecircuitry comprising the state machine, analog circuitry, digitalcircuitry, and/or logic circuitry. Still further note that, the memoryelement may store, and the processing module, module, processingcircuit, and/or processing unit executes, hard coded and/or operationalinstructions corresponding to at least some of the steps and/orfunctions illustrated in one or more of the Figures. Such a memorydevice or memory element can be included in an article of manufacture.

One or more embodiments have been described above with the aid of methodsteps illustrating the performance of specified functions andrelationships thereof. The boundaries and sequence of these functionalbuilding blocks and method steps have been arbitrarily defined hereinfor convenience of description. Alternate boundaries and sequences canbe defined so long as the specified functions and relationships areappropriately performed. Any such alternate boundaries or sequences arethus within the scope and spirit of the claims. Further, the boundariesof these functional building blocks have been arbitrarily defined forconvenience of description. Alternate boundaries could be defined aslong as the certain significant functions are appropriately performed.Similarly, flow diagram blocks may also have been arbitrarily definedherein to illustrate certain significant functionality.

To the extent used, the flow diagram block boundaries and sequence couldhave been defined otherwise and still perform the certain significantfunctionality. Such alternate definitions of both functional buildingblocks and flow diagram blocks and sequences are thus within the scopeand spirit of the claims. One of average skill in the art will alsorecognize that the functional building blocks, and other illustrativeblocks, modules and components herein, can be implemented as illustratedor by discrete components, application specific integrated circuits,processors executing appropriate software and the like or anycombination thereof.

In addition, a flow diagram may include a “start” and/or “continue”indication. The “start” and “continue” indications reflect that thesteps presented can optionally be incorporated in or otherwise used inconjunction with other routines. In this context, “start” indicates thebeginning of the first step presented and may be preceded by otheractivities not specifically shown. Further, the “continue” indicationreflects that the steps presented may be performed multiple times and/ormay be succeeded by other activities not specifically shown. Further,while a flow diagram indicates a particular ordering of steps, otherorderings are likewise possible provided that the principles ofcausality are maintained.

The one or more embodiments are used herein to illustrate one or moreaspects, one or more features, one or more concepts, and/or one or moreexamples. A physical embodiment of an apparatus, an article ofmanufacture, a machine, and/or of a process may include one or more ofthe aspects, features, concepts, examples, etc. described with referenceto one or more of the embodiments discussed herein. Further, from figureto figure, the embodiments may incorporate the same or similarly namedfunctions, steps, modules, etc. that may use the same or differentreference numbers and, as such, the functions, steps, modules, etc. maybe the same or similar functions, steps, modules, etc. or differentones.

Unless specifically stated to the contra, signals to, from, and/orbetween elements in a figure of any of the figures presented herein maybe analog or digital, continuous time or discrete time, and single-endedor differential. For instance, if a signal path is shown as asingle-ended path, it also represents a differential signal path.Similarly, if a signal path is shown as a differential path, it alsorepresents a single-ended signal path. While one or more particulararchitectures are described herein, other architectures can likewise beimplemented that use one or more data buses not expressly shown, directconnectivity between elements, and/or indirect coupling between otherelements as recognized by one of average skill in the art.

The term “module” is used in the description of one or more of theembodiments. A module implements one or more functions via a device suchas a processor or other processing device or other hardware that mayinclude or operate in association with a memory that stores operationalinstructions. A module may operate independently and/or in conjunctionwith software and/or firmware. As also used herein, a module may containone or more sub-modules, each of which may be one or more modules.

As may further be used herein, a computer readable memory includes oneor more memory elements. A memory element may be a separate memorydevice, multiple memory devices, or a set of memory locations within amemory device. Such a memory device may be a read-only memory, randomaccess memory, volatile memory, non-volatile memory, static memory,dynamic memory, flash memory, cache memory, and/or any device thatstores digital information. The memory device may be in a form a solidstate memory, a hard drive memory, cloud memory, thumb drive, servermemory, computing device memory, and/or other physical medium forstoring digital information.

While particular combinations of various functions and features of theone or more embodiments have been expressly described herein, othercombinations of these features and functions are likewise possible. Thepresent disclosure is not limited by the particular examples disclosedherein and expressly incorporates these other combinations.

What is claimed is:
 1. A method for execution by one or more processingmodules of one or more computing devices of a storage network (SN), themethod comprises: selecting a second storage unit based a decentralizedagreement decision, wherein the decentralized agreement decision isdetermined based on: a ranked scoring information request with regardsto a set of candidate storage unit resources that include the secondstorage unit; and for each of the candidate storage unit resources,performance of a deterministic function on a location identifier (ID) ofthe candidate storage unit resource and an asset ID of the rankedscoring information request; and initiating an evacuation of encodeddata slices from a first storage unit to the second storage unit.
 2. Themethod of claim 1, further comprising: receiving, at the second storageunit, a checked write slice request from a requesting entity, thechecked write slice request including a requested encoded data slice;and determining that locally stored encoded data slices do not includethe requested encoded data slice.
 3. The method of claim 2, wherein thechecked write slice request further includes one or more of: slice name,encoded data slice for storage, or a revision level.
 4. The method ofclaim 3, further comprising: generating a response to include one ormore of: a code associated with the checked write slice request, a nameof the encoded data slice, or a revision level.
 5. The method of claim4, wherein the determining that locally stored encoded data slices donot include the requested encoded data slice includes one or more of:performing a lookup or interpreting a query response.
 6. The method ofclaim 5, further comprising: identifying an alternate location for therequested encoded data slice; determining whether the alternate locationis associated with storage of the requested encoded data slice; and whenthe alternate location is associated with storage of the requestedencoded data slice, issuing a favorable checked write slice response tothe requesting entity.
 7. The method of claim 6, wherein the determiningwhether the alternate location is associated with the requested encodeddata slice includes one or more of: issuing a checked request to thealternate location or interpreting a checked response.
 8. The method ofclaim 6 further comprising facilitating transfer of the requestedencoded data slice from the alternate location to a location of thelocally stored encoded data slices for storage.
 9. A computing device ofa group of computing devices of a storage network (SN), the computingdevice comprises: an interface; a memory; and a processing moduleoperably coupled to the interface and the memory, wherein the processingmodule functions to perform operations including: selecting a secondstorage unit based a decentralized agreement decision, wherein thedecentralized agreement decision is determined based on: a rankedscoring information request with regards to a set of candidate storageunit resources that include the second storage unit; and for each of thecandidate storage unit resources, performance of a deterministicfunction on a location identifier (ID) of the candidate storage unitresource and an asset ID of the ranked scoring information request; andinitiating an evacuation of encoded data slices from a first storageunit to the second storage unit.
 10. The computing device of claim 9,wherein the operations further comprise: receiving, at the secondstorage unit, a checked write slice request from a requesting entity,the checked write slice request including a requested encoded dataslice; and determining that locally stored encoded data slices do notinclude the requested encoded data slice.
 11. The computing device ofclaim 10, wherein the checked write slice request further includes oneor more of: slice name, encoded data slice for storage, or a revisionlevel.
 12. The computing device of claim 11, wherein the operationsfurther include: generating a response to include one or more of: a codeassociated with the checked write slice request, a name of the encodeddata slice, or a revision level.
 13. The computing device of claim 12,wherein the determining that locally stored encoded data slices do notinclude the requested encoded data slice includes one or more of:performing a lookup or interpreting a query response.
 14. The computingdevice of claim 13, wherein the operations further include: identifyingan alternate location for the requested encoded data slice; determiningwhether the alternate location is associated with storage of therequested encoded data slice; and when the alternate location isassociated with storage of the requested encoded data slice, issuing afavorable checked write slice response to the requesting entity.
 15. Thecomputing device of claim 14, wherein the determining whether thealternate location is associated with the requested encoded data sliceincludes one or more of: issuing a checked request to the alternatelocation or interpreting a checked response.
 16. The computing device ofclaim 14 wherein the operations further include: facilitating transferof the requested encoded data slice from the alternate location to alocation of the locally stored encoded data slices for storage.
 17. Anon-transitory computer readable storage medium comprises: at least onememory section that stores operational instructions that, when executedby a processing system of a storage network (SN) that includes aprocessor and a memory, causes the processing system to performoperations including: selecting a second storage unit based adecentralized agreement decision, wherein the decentralized agreementdecision is determined based on: a ranked scoring information requestwith regards to a set of candidate storage unit resources that includethe second storage unit; and for each of the candidate storage unitresources, performance of a deterministic function on a locationidentifier (ID) of the candidate storage unit resource and an asset IDof the ranked scoring information request; and initiating an evacuationof encoded data slices from a first storage unit to the second storageunit.
 18. The non-transitory computer readable storage medium of claim17, wherein the operations further include: receiving, at the secondstorage unit, a checked write slice request from a requesting entity,the checked write slice request including a requested encoded dataslice; and determining that locally stored encoded data slices do notinclude the requested encoded data slice.
 19. The non-transitorycomputer readable storage medium of claim 18, wherein the checked writeslice request further includes one or more of: slice name, encoded dataslice for storage, or a revision level.
 20. The non-transitory computerreadable storage medium of claim 19, wherein the operations furtherinclude: generating a response to include one or more of: a codeassociated with the checked write slice request, a name of the encodeddata slice, or a revision level.